Quasi{lumpability, Lower Bounding Coupling Matrices, and Nearly Completely Decomposable Markov Chains
نویسنده
چکیده
In this paper, it is shown that nearly completely decomposable (NCD) Markov chains are quasi{lumpable. The state space partition is the natural one, and the technique may be used to compute lower and upper bounds on the stationary probability of each NCD block. In doing so, a lower bounding nonnegative coupling matrix is employed. The nature of the stationary probability bounds is closely related to the structure of this lower bounding matrix. Irreducible lower bounding matrices give tighter bounds compared with bounds obtained using reducible lower bounding matrices. It is also noticed that the quasi{lumped chain of a NCD Markov chain is an ill{conditioned matrix and the bounds obtained therefrom generally will not be tight. However, under some circumstances, it is possible to compute the stationary probabilities of some NCD blocks exactly.
منابع مشابه
Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
This paper presents an improved version of a componentwise bounding algorithm for the state probability vector of nearly completely decomposable Markov chains, and on an application it provides the first numerical results with the type of algorithm discussed. The given two-level algorithm uses aggregation and stochastic comparison with the strong stochastic (st) order. In order to improve accur...
متن کاملStochastic Comparison and NCD Markov
This paper presents an improved version of a componentwise bounding algorithm for the state probability vector of nearly completely decomposable Markov chains, and on an application it provides the rst numerical results with the type of algorithm discussed. The given two-level algorithm uses aggregation and stochastic comparison with the strong stochastic (st) order. In order to improve accurac...
متن کاملOn Weak Lumpability of Denumerable Markov Chains
We consider weak lumpability of denumerable discrete or continuous time Markov chains. Firstly, we are concerned with irreducible recurrent positive and R-positive Markov chains evolving in discrete time. We study the properties of the set of all initial distributions of the starting chain leading to an aggregated homogeneous Markov chain with respect to a partition of the state space. In parti...
متن کاملExact and Ordinary Lumpability in Finite Markov Chainsy
Exact and ordinary lumpability in nite Markov chains is considered. Both concepts naturally deene an aggregation of the Markov chain yielding an aggregated chain that allows the exact determination of several stationary and transient results for the original chain. We show which quantities can be determined without an error from the aggregated process and describe methods to calculate bounds on...
متن کاملWeak Lumpability of Finite Markov Chains and Positive Invariance of Cones
We consider weak lumpability of general nite homogeneous Markov chains evolving in discrete time, that is when a lumped Markov chain with respect to a partition of the initial state space is also a homogeneous Markov chain. We show that weak lumpabilityis equivalent to the existence of a decomposable polyhedral cone which is positively invariant by the transition probability matrix of the origi...
متن کامل